An Argument for the Uncomputability of Infinitary Mathematical Expertise

نویسنده

  • Selmer Bringsjord
چکیده

To a majority of the people involved in the study of expertise from a computational perspective, `expertise' tends to refer to domains such as medical diagnosis, aircraft piloting, auditing, etc. The reasoning in domains like these appears to be ready-made for computational packaging. But what if we try to cast a broader, braver net in an attempt to catch varieties of expertise out there in the real world which don't, at least at rst glance, look like they can be rendered in computational terms? In particular, what about mathematical expertise? In this chapter I focus on elementary \in nitary" expertise in the domain of mathematical logic. I argue that at least some of this expertise is indeed uncomputable. I end by brie y discussing the implications of this argument for the practice of AI and expert systems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

($phi,rho$)-Representation of $Gamma$-So-Rings

A $Gamma$-so-ring is a structure possessing a natural partial ordering, an infinitary partial addition and a ternary multiplication, subject to a set of axioms. The partial functions under disjoint-domain sums and functional composition is a $Gamma$-so-ring. In this paper we introduce the notions of subdirect product and $(phi,rho)$-product of $Gamma$-so-rings and study $(phi,rho)$-represen...

متن کامل

Coinductive Techniques in Infinitary Lambda-Calculus

The main aim of this paper is to promote a certain informal but rigorous style of doing coinductive proofs, similar to inductive proofs as commonly done by mathematicians. For this purpose we develop a theory which may serve as a reasonably direct justification for coinductive proofs written in this informal style, i.e., converting an informal coinductive proof into a non-coinductive argument m...

متن کامل

Supervenience and Infinitary Logic

The discussion of supervenience is replete with the use of infinitary logical operations. For instance, one may often find a supervenient property that corresponds to an infinite collection of supervenience-base properties, and then ask about the infinite disjunction of all those base properties. This is crucial to a well-known argument of Kim (1984) that supervenience comes nearer to reduction...

متن کامل

An ‎E‎ffective Numerical Technique for Solving Second Order Linear Two-Point Boundary Value Problems with Deviating Argument

Based on reproducing kernel theory, an effective numerical technique is proposed for solving second order linear two-point boundary value problems with deviating argument. In this method, reproducing kernels with Chebyshev polynomial form are used (C-RKM). The convergence and an error estimation of the method are discussed. The efficiency and the accuracy of the method is demonstrated on some n...

متن کامل

The Effect of Argument Mapping Instruction on L2 Writing Achievement across Writing Tasks and Writing Components: A Case of Iranian EFL Learners

Argument maps as schematic representations of arguments and their logical and evidential relationships are effective diagrams for instruction in education as well as in L2 development. However, their use for teaching L2 writing in EFL contexts has not been adequately studied. Therefore, this study investigated the effect of argument mapping instruction on Iranian EFL learners’ writing achieveme...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997